Distance-squared mappings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Certain Linear Mappings Between Inner-Product and Squared-Distance Matrices

We obtain the spectral decomposition of four linear mappings. The first, Ie, is a mapping of the linear hull of all centered inner-product matrices onto the linear hull of all the induced squared-distance matrices. It is based on the natural generalization of the cosine law of elementary Euclidean geometry. The other three mappings studied are ,,1, the adjoint ,,*, and (" *)1. Extensions and ap...

متن کامل

The limits of squared Euclidean distance regularization

Some of the simplest loss functions considered in Machine Learning are the square loss, the logistic loss and the hinge loss. The most common family of algorithms, including Gradient Descent (GD) with and without Weight Decay, always predict with a linear combination of the past instances. We give a random construction for sets of examples where the target linear weight vector is trivial to lea...

متن کامل

CHI-SQUARED DISTANCE AND METAMORPHIC VIRUS DETECTION A Thesis

CHI-SQUARED DISTANCE AND METAMORPHIC VIRUS DETECTION by Annie H. Toderici Malware are programs that are designed with a malicious intent. Metamorphic malware change their internal structure each generation while still maintaining their original behavior. As metamorphic malware become more sophisticated, it is important to develop efficient and accurate detection techniques. Current commercial a...

متن کامل

Geometry of the Squared Distance Function to Curves and Surfaces

We investigate the geometry of that function in the plane or 3-space, which associates to each point the square of the shortest distance to a given curve or surface. Particular emphasis is put on second order Taylor approximants and other local quadratic approximants. Their key role in a variety of geometric optimization algorithms is illustrated at hand of registration in Computer Vision and s...

متن کامل

Clustering by Maximizing Sum-of-Squared Separation Distance

Maximizing the separating margin is crucial for the good generalization performance of Support Vector Machines (SVMs). Analogous to the definition of separation distance or separating margin in SVMs, we propose a definition on separation distance in clustering tasks when a hyperplane is used to separate clusters. For given training data and a given metric distance, by maximizing the proposed se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2013

ISSN: 0166-8641

DOI: 10.1016/j.topol.2013.03.011